package exercise.Fibonacci;

public class FibonacciRecursion {
    static int fib(int n){
        if(n<=0)return 0;
        if(n<=2)return 1;
        else return fib(n-1)+fib(n-2);
    }

    public static void main(String[] args) {
        for(int i=1;i<=20;i++){
            System.out.printf("%5d\t",fib(i));
            if(i%5==0) System.out.println();
        }
    }
}
